Dynamic programming for spanning tree problems: application to the multi-objective case
نویسندگان
چکیده
منابع مشابه
Multi-objective branch-and-bound. Application to the bi-objective spanning tree problem
This paper focuses on a multi-objective derivation of branch-and-bound procedures. Such a procedure aims to provide the set of Pareto optimal solutions of a multi-objective combinatorial optimization problem. Unlike previous works on this issue, the bounding is performed here via a set of points rather than a single ideal point. The main idea is that a node in the search tree can be discarded i...
متن کاملMulti-Source Spanning Tree Problems
We consider a model of communication in a network, where multiple sources have messages to disseminate among the network membership. We propose that all the messages (one from each source) be disseminated along the same spanning tree of the network and consider the problem of constructing such a tree. One evaluative measure for suitability of the construction is the sum of distances from each s...
متن کاملProviding a Method for Solving Interval Linear Multi-Objective Problems Based on the Goal Programming Approach
Most research has focused on multi-objective issues in its definitive form, with decision-making coefficients and variables assumed to be objective and constraint functions. In fact, due to inaccurate and ambiguous information, it is difficult to accurately identify the values of the coefficients and variables. Interval arithmetic is appropriate for describing and solving uncertainty and inaccu...
متن کاملA new method for solving fuzzy multi-objective linear programming problems
The purpose of this paper is to develop a new two-stage method for fuzzy multi-objective linear program and apply to engineering project portfolio selection. In the fuzzy multi-objective linear program, all the objective coefficients, technological coefficients and resources are trapezoidal fuzzy numbers (TrFNs). An order relationship for TrFNs is introduced by using the interval expectation of...
متن کاملOffline Algorithms for Dynamic Minimum Spanning Tree Problems
We describe an efficient algorithm for maintaining a minimum spanning tree (MST) in a graph subject to a sequence of edge weight modifications. The sequence of minimum spanning trees is computed offline, after the sequence of modifications is known. The algorithm performs O(log n) work per modification, where n is the number of vertices in the graph. We use our techniques to solve the offline g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2014
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-014-0759-1